type theory - определение. Что такое type theory
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое type theory - определение

Найдено результатов: 8209
Type theory         
CONCEPT IN MATHEMATICAL LOGIC AND COMPUTER SCIENCE
Typed logic; Theory of types; Type Theory; Theory of Types; Type-theoretic; Type (mathematics); System of types; Logical type; Theory of Logical Types; Equality type; Propositional equality; Type (type theory); Draft:Universe (type theory); Universe types; Elementary Theory of the Category of Sets; Universe type; Applications of type theory; List of type theories; Natural language semantics and type theory
In mathematics, logic, and computer science, a type theory is the formal presentation of a specific type system, and in general type theory is the academic study of type systems. Some type theories serve as alternatives to set theory as a foundation of mathematics.
Intuitionistic type theory         
ALTERNATIVE FOUNDATION OF MATHEMATICS
Intuitionistic Theory of Types; Constructive type theory; Intuitionistic theory of types; Constructivist type theory; Martin-Löf Type Theory; Constructive Type Theory; Martin-Löf type theory; Martin-Loef's type theory; Martin-Löf's type theory; Intuitionistic Type Theory; Martin-Lof type theory; Martin-Lof's type theory; Martin-Loef type theory; Martin-Lof Type Theory; Martin-Loef Type Theory; Intensional type theory; Extensional type theory; Inductive family; Martin–Löf type theory
Intuitionistic type theory (also known as constructive type theory, or Martin-Löf type theory) is a type theory and an alternative foundation of mathematics.
Type II string theory         
10-DIMENSIONAL STRING THEORY WITH N=2 SUPERSYMMETRY (32 SUPERCHARGES), EITHER AS N=(2,0) (TYPE IIA) OR N=(1,1) (TYPE IIB)
Type IIB string; Type IIB string theory; Type IIB superstring; Type IIB superstring theory; Type IIA string theory; Type IIA superstring; Type IIA superstring theory; Type IIA string; Type II superstring; Type II superstring theory; Type II string; Type II A string theory; Type II B string theory; Type IIB; Type 2 string theory; Type IIA
In theoretical physics, type II string theory is a unified term that includes both type IIA strings and type IIB strings theories. Type II string theory accounts for two of the five consistent superstring theories in ten dimensions.
Type I string theory         
THEORY OF STRINGS WHERE LEFT- AND RIGHT-MOVERS ARE IDENTIFIED VIA ORIENTIFOLDING, OBTAINED AS IIB STRING THEORY WITH 32 SPACETIME-FILLING D9-BRANES (PRODUCING A O(32) GAUGE GROUP) AND A SPACETIME-FILLING O9-PLANE
Type I superstring; Type I string; Type 1 string theory
In theoretical physics, type I string theory is one of five consistent supersymmetric string theories in ten dimensions. It is the only one whose strings are unoriented (both orientations of a string are equivalent) and the only one which contains not only closed strings, but also open strings.
History of type theory         
ASPECT OF HISTORY
Simple theory of types
The type theory was initially created to avoid paradoxes in a variety of formal logics and rewrite systems. Later, type theory referred to a class of formal systems, some of which can serve as alternatives to naive set theory as a foundation for all mathematics.
Type 0 string theory         
STRING THEORY WITH WORLDSHEET SUPERSYMMETRY BUT NO TARGET-SPACE SUPERSYMMETRY
Type 0 string; Type 0A string theory; Type 0B string theory
The Type 0 string theory is a less well-known model of string theory. It is a superstring theory in the sense that the worldsheet theory is supersymmetric.
Type A and Type B personality theory         
PERSONALITY HYPOTHESIS WHICH DESCRIBES TWO CONTRASTING PERSONALITY TYPES
Type-A behavior; Type B personality; Type a personality; Type A behaviour; Type B behaviour; Type A personality; Type b personality; Type A/Type B Personality
Type A and Type B personality hypothesis describes two contrasting personality types. In this hypothesis, personalities that are more competitive, highly organized, ambitious, impatient, highly aware of time management, or aggressive are labeled Type A, while more relaxed, "receptive", less "neurotic" and "frantic" personalities are labeled Type B.
Type theory with records         
Type theory with records is a formal semantics representation framework, using records to express type theory types. It has been used in natural language processing, principally computational semantics and dialogue systems.
Type physicalism         
IN THE PHILOSOPHY OF MIND, A PHYSICALIST THEORY ASSERTING THAT MENTAL EVENTS CAN BE GROUPED INTO TYPES, AND CAN THEN BE CORRELATED WITH TYPES OF PHYSICAL EVENTS IN THE BRAIN
Reductive materialism; Identity theory of mind; Identity Theory; Type identity theory; Type-type identity; Type materialism; Type-identity theory; Type identity; Mind-Brain Identity Theory; Psychoneural identity theory; Type-type theory; Reductive materialist; Theory of identity between mind and brain; Theory of identity between brain and mind; Mind–brain identity theory; Mind-brain identity theory
Type physicalism (also known as reductive materialism, type identity theory, mind–brain identity theory and identity theory of mind) is a physicalist theory in the philosophy of mind. It asserts that mental events can be grouped into types, and can then be correlated with types of physical events in the brain.
Type (model theory)         
TERM IN MODEL THEORY AND RELATED AREAS OF MATHEMATICS
Omitting types theorem; Complete type; Omitting types
In model theory and related areas of mathematics, a type is an object that describes how a (real or possible) element or finite collection of elements in a mathematical structure might behave. More precisely, it is a set of first-order formulas in a language L with free variables x1, x2,…, xn that are true of a sequence of elements of an L-structure \mathcal{M}.